Minimal congestion trees
نویسنده
چکیده
Let G be a graph and let T be a tree with the same vertex set. Let e be an edge of T and Ae and Be be the vertex sets of the components of T obtained after removal of e. Let EG(Ae, Be) be the set of edges of G with one endvertex in Ae and one endvertex in Be. Let ec(G : T ) := max e |EG(Ae, Be)|. The paper is devoted to minimization of ec(G : T ) • Over all trees with the same vertex set as G. • Over all spanning trees of G. These problems can be regarded as “congestion” problems.
منابع مشابه
Embedding Tree-related Graphs into Hypercubes
We propose a general strategy of many-to-one embedding of tree-related graphs into hypercubes. These tree-related graphs include complete binary tree (CBT), mesh of trees (MOT), pyramid and so on. This strategy evenly distributes the same level nodes of a tree-related graph to the nodes of a hypercube. This distribution is a great advantage because the same level nodes are always activated simu...
متن کاملSpanning tree congestion critical graphs
The linear or cyclic cutwidth of a graph G is the minimum congestion when G is embedded into either a path or a cycle respectively. A graph is cutwith critical if it is homeomorphically minimal and all of its subgraphs have lower cutwitdth. Our purpose is to extend the study of congestion critical graphs to embeddings on spanning trees.
متن کاملOn spanning tree congestion
We prove that every connected graph G of order n has a spanning tree T such that for every edge e of T the edge-cut defined in G by the vertex sets of the two components of T − e contains at most n 32 many edges which solves a problem posed by Ostrovskii (Minimal congestion trees, Discrete Math. 285 (2004), 219-226.)
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملDynamic Evolution of Congestion Trees: Analysis and Impact on Switch Architecture
Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to reduce them consists of reducing the number of network components and increasing their utilization. However, doing so without a suitable congestion management mechanism may lead to dramatic throughput degradation when the netw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 285 شماره
صفحات -
تاریخ انتشار 2004